Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
نویسندگان
چکیده
منابع مشابه
On risks of using cuckoo hashing with simple universal hash classes
Cuckoo hashing, introduced by Pagh and Rodler [10], is a dynamic dictionary data structure for storing a set S of n keys from a universe U , with constant lookup time and amortized expected constant insertion time. For the analysis, space (2+ε)n and Ω(logn)-wise independence of the hash functions is sufficient. In experiments mentioned in [10], several weaker hash classes worked well; however, ...
متن کاملOn risks of using a high performance hashing scheme with common universal classes
The contribution of this thesis is a mathematical analysis a high performance hashing scheme called cuckoo hashing when combined with two very simple and efficient classes of functions that we refer to as the multiplicative class and the linear class, respectively. We prove that cuckoo hashing tends to work badly with these classes. In order to show this, we investigate how the inner structure ...
متن کاملAn Overview of Cuckoo Hashing
Cuckoo Hashing is a technique for resolving collisions in hash tables that produces a dictionary with constant-time worst-case lookup and deletion operations as well as amortized constant-time insertion operations. First introduced by Pagh in 2001 [3] as an extension of a previous static dictionary data structure, Cuckoo Hashing was the first such hash table with practically small constant fact...
متن کاملA Simple Hash Class with Strong Randomness Properties in Graphs and Hypergraphs
We study randomness properties of graphs and hypergraphs generated by simple hash functions. Several hashing applications can be analyzed by studying the structure of d-uniform random (d-partite) hypergraphs obtained from a set S of n keys and d randomly chosen hash functions h1, . . . , hd by associating each key x ∈ S with a hyperedge {h1(x), . . . , hd(x)}. Often it is assumed that h1, . . ....
متن کاملConstant Access Time ?
We generalize Cuckoo Hashing 23] to d-ary Cuckoo Hashing and show how this yields a simple hash table data structure that stores n elements in (1 +) n memory cells, for any constant > 0. Assuming uniform hashing, accessing or deleting table entries takes at most d = O(ln 1) probes and the expected amortized insertion time is constant. This is the rst dictionary that has worst case constant acce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009